Polynomials related to generalized Chebyshev polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomials Related to Generalized Chebyshev Polynomials

We study several classes of polynomials, which are related to the Chebyshev, Morgan-Voyce, Horadam and Jacobsthal polynomials. Thus, we unify some of well-known results.

متن کامل

Generalized Chebyshev polynomials of the second kind

We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...

متن کامل

Symmetrized Chebyshev Polynomials

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...

متن کامل

Orthogonal Polynomials Related to the Oscillatory-chebyshev Weight Function

L(p) = ∫ 1 −1 p(x)x(1− x2)−1/2eiζxdx, ζ ∈ R. Since the weight function alternates in sign in the interval of orthogonality, the existence of orthogonal polynomials is not assured. A nonconstructive proof of the existence is given. The three-term recurrence relation for such polynomials is investigated and the asymptotic formulae for recursion coefficients are derived. AMS Mathematics Subject Cl...

متن کامل

On integer Chebyshev polynomials

We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2009

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil0903279d